Phase transformation of Ni-B, Ni-P diffusion barrier deposited electrolessly on Cu interconnect

In this paper, we report that the phase transformation of Ni-B, Ni-P diffusion barriers deposited electrolessly on Cu, for the reason that the Ni-P layer is a more effective diffusion barrier than the Ni-B layer. The Ni₃B crystallized was decomposed to Ni and B₂O₃ above 400 °C and the Ni₃P crystallized was decomposed to Ni and P₂O₅ above 600 °C respectively in Ar atmosphere. Also, the Ni₃B was decomposed to Ni and free B above 400 °C and the Ni₃P was decomposed to Ni and free P above 600 °C respectively in H₂ atmosphere. The decomposed Ni formed a solid solution with Cu. The Cu diffusion occurred above 400 °C for Ni-B layer and above 600 °C for Ni-P layer, respectively. Because the decomposition temperature of Ni-P layer is about 200 °C higher than that of Ni-B layer, the Ni-P layer is a more effective barrier for Cu than the Ni-B layer.     

推广的Kantorovich算子在Ba空间中的逼近

利用Ditzian-Totik光滑模,研究了推广的Kantorovich算子在Ba空间中的逼近,得到逼近的正定理与等价定理.所得结果改进、推广和统一了一些作者的结果.     

D_x-广义正定矩阵

讨论Dx广义正定阵的问题,给出了Dx广义正定阵的一些等价性的刻划,同时还讨论了Dx广义正定阵的若干性质.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

A new approach based on the surrogating method in the project time compression problems

This paper develops a mathematical model for project time compression problems in CPM/PERT type networks. It is noted this formulation of the problem will be an adequate approximation for solving the time compression problem with any continuous and non-increasing time-cost curve. The kind of this model is Mixed Integer Linear Program (MILP) with zero-one variables, and the Benders' decomposition procedure for analyzing this model has been developed. Then this paper proposes a new approach based on the surrogating method for solving these problems. In addition, the required computer programs have been prepared by the author to execute the algorithm. An illustrative example solved by the new algorithm, and two methods are compared by several numerical examples. Computational experience with these data shows the superiority of the new approach.     

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

Thermal decomposition of a generation 4.5 PAMAM dendrimer platinum drug conjugate

A nanoscale multivalent platinum drug based on a poly(amidoamine) [PAMAM] dendrimer (generation 4.5, carboxylate surface) has been synthesized and fully characterized using a variety of spectroscopic, chromatographic and thermal methods. Treatment of the dendrimer with an aqueous solution containing an excess diaquo(cis-1,2-diaminocyclohexane)platinum(II) produces a conjugate containing approximately forty (diaminocyclohexane)platinum(II) moieties at the surface of the dendrimer. This material undergoes smooth two-stage thermal decomposition to provide residual platinum oxide reflecting the platinum loading in the drug.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Analysis of Decomposition Algorithms with Benders Cuts for p-Median Problem

In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one.     

一致Lipschitz映射的遍历定理及其遍历分解

设(X,d)是一个可分的度量空间,Cu(X,d)是由全体一致连续函数所组成的C(X,d)的子空间,T是定义在X上的一致Lipschitz映射,那么对f∈Cu(X),1/n n∑k=1 Uk If在Cu(X)上收敛.从这个基本结果出发,利用Cu(X,d)的共扼空间的表示定理,得到了相空间的Yosida型遍历分解;利用空间的嵌入技术证明了非一致Lipschitz映射的大数法则.